A Complete Bibliography of Publications in the ACM Symposia on Theory of Computing (STOC) for 1990–1999
نویسنده
چکیده
(log n)2−o(1) [GH95]. + 1 [DN95]. .879 [GW94a]. 1 [ANTSV99, Mul90]. 2 [DN95, GW94a, HdLT98, KP94c]. 3 [AK94, DG96, GK98, PSZ97, VV96]. 4/3 [CG91]. = [IW97]. [p] [MP97]. E [IW97]. [CEG93, LV92]. j [Fei95]. K [Fre98b, Gro91, ARR98, AKTT97, AABV95, BKPS98, BCV96, BR92, BCV95, BRV96, BD95, CK92, CCGG98, CGTS99, CT91, CT96, cDF97, FW93, GH94, JL93, KRR91, KM94b, KP94b, Mul90, SZ93]. L2 [Ajt98]. lnn [Fei96]. log logN [AM92b]. m [Gro94, Sze90]. N [AM92b, BBBT97, CK92]. 6= [Mul97]. O(congestion+ dilation+ log N) [OR97]. O(log k) [GH94]. O(n) [BK96, KS93]. O(n) [Ben94]. O(n log m) [CH97]. O(n log n) [Ma96]. O(nm) [NI96]. ω [Saf92]. Ω(n) [GK97]. p [Ajt94]. R [MLS92, Mul90]. s [BR91, BK96]. SL ⊆ L [ATSWZ97]. st [EP95]. ⊆ [Nis92]. t [BR91, BK96, BG93, HS93a]. t+ 1 [GM93]. W [BFH94].
منابع مشابه
A Complete Bibliography of Publications in the ACM Symposia on Theory of Computing (STOC) for 2000–2009
Ach00, ASV00, AKK08, BBB00, CGGM00, CV00, CG09, CFG00, CW09a, CS00, DSY00, FKK00, FKN00, GS00a, GV00, HT04, Ist00, JKN08, KNT00, KPT09, MV00, MPSV00, NRR00, OSS00, PV00, Pei09, RW00b, Sch00, Vyg00]. AC [JKS02, She07]. Access [Gol09]. accessibility [MPSV00]. achieving [GR06, Kat07, PS04]. acknowledgement [KKR01]. ACM [ACM00, ACM01, ACM02, ACM03, ACM05, ACM06, ACM07, ACM08, ACM09, ACM10]. across ...
متن کاملWork and Publications
s: Some of the original abstracts are reproduced almost without change and some with minor revision. The former cases are indicated by v.o., whereas the latter cases are indicated by rev. Common abbreviations (for the publication items) include: CCC: Annual IEEE Conference on Computational Complexity. COLT: Annual ACM Workshop on Computational Learning Theory. FOCS: Annual IEEE Symposium on Fou...
متن کاملAverage stretch without migration
We study the problem of scheduling parallel machines online, allowing preemptions while disallowing migration of jobs that have been scheduled on one machine to another. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, defined as the ratio between the amount of time spent by the job in the system (the response time) and its processing time. ...
متن کامل